Directed and Almost-Directed Flow Loops in Real Networks
نویسندگان
چکیده
منابع مشابه
Directed and Almost-Directed Flow Loops in Real Networks
Directed flow loops are highly undesirable because they are associated with wastage of energy for maintaining them and entail big losses to the world economy. It is shown that directed flow loops may appear in networks even if the dispatched commodity does not physically travel along a closed contour. Consequently, a theorem giving the necessary and sufficient condition of a directed flow loop ...
متن کاملCycle and flow trusses in directed networks
When we represent real-world systems as networks, the directions of links often convey valuable information. Finding module structures that respect link directions is one of the most important tasks for analysing directed networks. Although many notions of a directed module have been proposed, no consensus has been reached. This lack of consensus results partly because there might exist distinc...
متن کاملOrganisation of signal flow in directed networks
Confining an answer to the question whether and how the coherent operation of network elements is determined by the the network structure is the topic of our work. We map the structure of signal flow in directed networks by analysing the degree of edge convergence and the overlap between the inand output sets of an edge. Definitions of convergence degree and overlap are based on the shortest pa...
متن کاملFlow‐directed PCA for monitoring networks
Measurements recorded over monitoring networks often possess spatial and temporal correlation inducing redundancies in the information provided. For river water quality monitoring in particular, flow-connected sites may likely provide similar information. This paper proposes a novel approach to principal components analysis to investigate reducing dimensionality for spatiotemporal flow-connecte...
متن کاملConcave Flow on Small Depth Directed Networks
Small depth networks arise in a variety of network related applications, often in the form of maximum flow and maximum weighted matching. Recent works have generalized such methods to include costs arising from concave functions. In this paper we give an algorithm that takes a depth D network and strictly increasing concave weight functions of flows on the edges and computes a (1−ǫ)-approximati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Advanced Computer Science and Applications
سال: 2013
ISSN: 2158-107X,2156-5570
DOI: 10.14569/ijacsa.2013.040821